منابع مشابه
Universit at Augsburg Classiication of Late Roman Bronze Coins Using an Object-oriented Database Classiication of Late Roman Bronze Coins Using an Object-oriented Database
The combination of digital libraries and applications from humanities is an important emerging eld that still faces great challenges. In this paper we investigate the science of numismatics and analyse how to digitize current manual practice for the classiication of ancient coins from the 4th century A.C. Our contributions are twofold. From the application's point of view we develop an improved...
متن کاملThe Coins of the Pāratarājas
It seems fitting that, at a seminar organized to celebrate the 100 th anniversary of the Numismatic Society of India, I present a paper that offers a solution to a problem even older than the Society. In 1905, E. J. Rapson had published a small group of five coins which he identified as „Coins with reverse type “Svastika.”‟ 2 The coins were unified by the presence on their reverses of a central...
متن کاملMoving coins
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, and moves are defined as collision free translations, all in the Euclidean plane. We obtain combinatorial bounds on the number of moves that are necessary and/or sufficient to move coins from one configuration to anothe...
متن کاملDetachable Electronic Coins
We propose a non-divisible electronic cash system that combines the restrictive blind signature technique and a batch signature scheme based upon the binary tree structure. Contemporary electronic cash solutions rely on the divisibility paradigm to achieve significant computational savings, and such techniques are considered to be the most efficient. We demonstrate an alternative approach that ...
متن کاملPrivate Coins versus Public Coins in Zero-Knowledge Proof Systems
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “fully black-box” privatecoin protocols based on one-way functions. More precisely, we show that only languages in BPP—where Sam is a “collision-finding” oracle in analogy with Simon (Eurocrypt’98) and Haitner et. al (FOCS’07...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Archaeology
سال: 2015
ISSN: 1363-5387
DOI: 10.11141/ia.40.1.guest